Tight estimates for non-stationary consensus with fixed underlying spanning tree
نویسندگان
چکیده
This article is devoted to estimating the speed of convergence towards consensus for a general class of discrete-time multi-agent systems. In the systems considered here, both the topology of the interconnection graph and the weight of the arcs are allowed to vary as a function of time. Under the hypothesis that some spanning tree structure is preserved along time, and that some nonzero minimal weight of the information transfer along this tree is guaranteed, an estimate of the contraction rate is given. The latter is expressed explicitly as the spectral radius of some matrix depending upon the tree depth and the lower bounds on the weights.
منابع مشابه
Tight estimates for convergence of some non-stationary consensus algorithms
The present paper is devoted to estimating the speed of convergence towards consensus for a general class of discrete-time multi-agent systems. In the systems considered here, both the topology of the interconnection graph and the weight of the arcs are allowed to vary as a function of time. Under the hypothesis that some spanning tree structure is preserved along time, and that some nonzero mi...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملNonlinear Multi-Agent System Consensus with Time-Varying Delays
Most consensus protocols for Multi-Agent Systems (MAS) presented in the past do not consider communication constraints such as delays in the exchange of information between the agents. In this paper, we provide conditions for a nonlinear, locally passive MAS with timevarying communication delays to reach a consensus, using a recently presented method based on an invariance principle for Lyapuno...
متن کاملFinite-time Consensus for Nonlinear Multi-agent Systems with Fixed Topologies
In this paper, we study finite-time state consensus problems for continuous nonlinear multi-agent systems. Building on the theory of finite-time Lyapunov stability, we propose sufficient criteria which guarantee the system to reach a consensus in finite time, provided that the underlying directed network contains a spanning tree. Novel finite-time consensus protocols are introduced as examples ...
متن کاملConvergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees
Results for estimating the convergence rate of non-stationary distributed consensus algorithms are provided, on the basis of qualitative (mainly topological) as well as basic quantitative information (lower-bounds on the matrix entries). The results appear to be tight in a number of instances and are illustrated through simple as well as more sophisticated examples. The main idea is to follow p...
متن کامل